Orientation-Constrained Rectangular Layouts

نویسندگان

  • David Eppstein
  • Elena Mumford
چکیده

We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientationconstrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Area - Universal and Constrained Rectangular

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignm...

متن کامل

The Influence of Grid Rotation in von Neumann and Moore Neighborhoods on Agent Behavior in Pedestrian Simulation

Most crowd simulations (CS) in architectural spaces are based on rectangular grids with von Neumann or Moore neighborhoods. The distance in the former is defined by the von Neumann metric (vN), and in the latter can be defined by both Manhattan (MM) and Euclidean (ME) metrics. A real space, however, is not limited to right angles. How does the rotation of the grid influence the simulation? Whic...

متن کامل

Evolutionary-driven search for solar building models using LiDAR data

The search for solar buildings is one of the primary challenges in urban planning, especially when developing self-sustainable cities. This work uses an evolutionary approach for finding the optimal building model based on airborne Light Detection And Ranging (LiDAR) laser-scanned data, regarding solar potential. The method considers self-adaptive differential evolution for solving the constrai...

متن کامل

A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts

A rectangular layout L is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent VLSI chip layouts. More recently, they are used in graph drawing as rectangular cartograms. In these applications, an area a(r) is assigned to each rectangle r, and the act...

متن کامل

Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities

This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. The layout problem considered in this paper is characterized by affinity weights used to model transportation c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009